A Galois Connection Approach to Wei-Type Duality Theorems
نویسندگان
چکیده
In 1991, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of linear code and those its dual code. Wei’s has since been extensively studied from different perspectives extended to other settings. this paper, we re-examine various extensions, henceforth referred as Wei-type theorems, new Galois perspective. Our approach is based on observation dimension/length profiles form connection. The central result paper general for two connections finite subsets $\mathbb {Z}$ , which all known theorems can be recovered. As corollaries our result, prove notation="LaTeX">$w$ -demi-matroids defined over sets -demi-polymatroids modules with composition series, further allows us unify generalize codes endowed metrics.
منابع مشابه
Wei-type duality theorems for matroids
We present several fundamental duality theorems for matroids and more general combinatorial structures. As a special case, these results show that the maximal cardinalities of fixed-ranked sets of a matroid determine the corresponding maximal cardinalities of the dual matroid. Our main results are applied to perfect matroid designs, graphs, transversals, and linear codes over division rings, in...
متن کاملDuality Based on Galois Connection. Part I
In the paper, we investigate the duality of categories of complete lattices and maps preserving suprema or infima according to [15, p. 179–183; 1.1–1.12]. The duality is based on the concept of the Galois connection. Let S, T be complete lattices. Note that there exists a connection between S and T which is Galois. One can prove the following proposition (1) Let S, T , S , T be non empty relati...
متن کاملDuality Theorems in Galois Cohomology over Number Fields
the direct limit taken over all finite Galois extensions K of k in which the integral closure Y of X is unramified over X, where GKJk denotes the Galois group of such an extension, and where GY denotes the group of points of G with coordinates in Y. For example, if X=k, our notation coincides with that of [10]. For any X, the group H(X,C) is the r-th cohomology group of the profinite group Gjr=...
متن کاملDuality Based on the Galois Connection. Part I
Let S, T be complete lattices. One can check that there exists a connection between S and T which is Galois. Next we state the proposition (1) Let S, T , S, T ′ be non empty relational structures. Suppose that (i) the relational structure of S = the relational structure of S, and (ii) the relational structure of T = the relational structure of T . Let c be a connection between S and T and c be ...
متن کاملcomputing character degrees via a galois connection
in a previous paper, the second author established that, given finite fields $f < e$ and certain subgroups $c leq e^times$, there is a galois connection between the intermediate field lattice ${l mid f leq l leq e}$ and $c$'s subgroup lattice. based on the galois connection, the paper then calculated the irreducible, complex character degrees of the semi-direct product $c rtimes {rm gal} (e/f)$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3167848